Online Admission Control and Embedding of Service Chains

The virtualization and softwarization of modern computer networks enables the definition and fast deployment of novel network services called service chains: sequences of virtualized network functions (e.g., firewalls, caches, traffic optimizers) through which traffic is routed between source and destination. This paper attends to the problem of admitting and embedding a maximum number of service chains, i.e., a maximum number of source-destination pairs which are routed via a sequence of to-be-allocated, capacitated network functions. We consider an Online variant of this maximum Service Chain Embedding Problem, short OSCEP, where requests arrive over time, in a worst-case manner. Our main contribution is a deterministic O(log L)-competitive online algorithm, under the assumption that capacities are at least logarithmic in L. We show that this is asymptotically optimal within the class of deterministic and randomized online algorithms. We also explore lower bounds for offline approximation algorithms, and prove that the offline problem is APX-hard for unit capacities and small L > 2, and even Poly-APX-hard in general, when there is no bound on L. These approximation lower bounds may be of independent interest, as they also extend to other problems such as Virtual Circuit Routing. Finally, we present an exact algorithm based on 0-1 programming, implying that the general offline SCEP is in NP and by the above hardness results it is NP-complete for constant L.Comment: early version of SIROCCO 2015 pape

The effect of age and hearing loss on partner-directed gaze in a communicative task

The study examined the partner-directed gaze patterns of old and young talkers in a task (DiapixUK) that involved two people (a lead talker and a follower) engaging in a spontaneous dialogue. The aim was (1) to determine whether older adults engage less in partner-directed gaze than younger adults by measuring mean gaze frequency and mean total gaze duration; and (2) examine the effect that mild hearing loss may have on older adult’s partner-directed gaze. These were tested in various communication conditions: a no barrier condition; BAB2 condition in which the lead talker and the follower spoke and heard each other in multitalker babble noise; and two barrier conditions in which the lead talker could hear clearly their follower but the follower could not hear the lead talker very clearly (i.e., the lead talker’s voice was degraded by babble (BAB1) or by a Hearing Loss simulation (HLS). 57 single-sex pairs (19 older adults with mild Hearing Loss, 17 older adults with Normal Hearing and 21 younger adults) participated in the study. We found that older adults with normal hearing produced fewer partner-directed gazes (and gazed less overall) than either the older adults with hearing loss or younger adults for the BAB1 and HLS conditions. We propose that this may be due to a decline in older adult’s attention to cues signaling how well a conversation is progressing. Older adults with hearing loss, however, may attend more to visual cues because they give greater weighting to these for understanding speech

The effects of high variability training on voice identity learning.

High variability training has been shown to benefit the learning of new face identities. In three experiments, we investigated whether this is also the case for voice identity learning. In Experiment 1a, we contrasted high variability training sets - which included stimuli extracted from a number of different recording sessions, speaking environments and speaking styles - with low variability stimulus sets that only included a single speaking style (read speech) extracted from one recording session (see Ritchie & Burton, 2017 for faces). Listeners were tested on an old/new recognition task using read sentences (i.e. test materials fully overlapped with the low variability training stimuli) and we found a high variability disadvantage. In Experiment 1b, listeners were trained in a similar way, however, now there was no overlap in speaking style or recording session between training sets and test stimuli. Here, we found a high variability advantage. In Experiment 2, variability was manipulated in terms of the number of unique items as opposed to number of unique speaking styles. Here, we contrasted the high variability training sets used in Experiment 1a with low variability training sets that included the same breadth of styles, but fewer unique items; instead, individual items were repeated (see Murphy, Ipser, Gaigg, & Cook, 2015 for faces). We found only weak evidence for a high variability advantage, which could be explained by stimulus-specific effects. We propose that high variability advantages may be particularly pronounced when listeners are required to generalise from trained stimuli to different-sounding, previously unheard stimuli. We discuss these findings in the context of mechanisms thought to underpin advantages for high variability training

Abstract Interpretation of Supermodular Games

Supermodular games find significant applications in a variety of models, especially in operations research and economic applications of noncooperative game theory, and feature pure strategy Nash equilibria characterized as fixed points of multivalued functions on complete lattices. Pure strategy Nash equilibria of supermodular games are here approximated by resorting to the theory of abstract interpretation, a well established and known framework used for designing static analyses of programming languages. This is obtained by extending the theory of abstract interpretation in order to handle approximations of multivalued functions and by providing some methods for abstracting supermodular games, in order to obtain approximate Nash equilibria which are shown to be correct within the abstract interpretation framework

Inapproximability of maximal strip recovery

In comparative genomic, the first step of sequence analysis is usually to decompose two or more genomes into syntenic blocks that are segments of homologous chromosomes. For the reliable recovery of syntenic blocks, noise and ambiguities in the genomic maps need to be removed first. Maximal Strip Recovery (MSR) is an optimization problem proposed by Zheng, Zhu, and Sankoff for reliably recovering syntenic blocks from genomic maps in the midst of noise and ambiguities. Given $d$ genomic maps as sequences of gene markers, the objective of \msr{d} is to find $d$ subsequences, one subsequence of each genomic map, such that the total length of syntenic blocks in these subsequences is maximized. For any constant $d \ge 2$, a polynomial-time 2d-approximation for \msr{d} was previously known. In this paper, we show that for any $d \ge 2$, \msr{d} is APX-hard, even for the most basic version of the problem in which all gene markers are distinct and appear in positive orientation in each genomic map. Moreover, we provide the first explicit lower bounds on approximating \msr{d} for all $d \ge 2$. In particular, we show that \msr{d} is NP-hard to approximate within $\Omega(d/\log d)$. From the other direction, we show that the previous 2d-approximation for \msr{d} can be optimized into a polynomial-time algorithm even if $d$ is not a constant but is part of the input. We then extend our inapproximability results to several related problems including \cmsr{d}, \gapmsr{\delta}{d}, and \gapcmsr{\delta}{d}.Comment: A preliminary version of this paper appeared in two parts in the Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC 2009) and the Proceedings of the 4th International Frontiers of Algorithmics Workshop (FAW 2010

Electromyography‐related pain: Muscle selection is the key modifiable study characteristic

Introduction : The aim of this study was to estimate the effects of patient, provider, and study characteristics on electromyography (EMG)‐related pain. Methods : Patients undergoing EMG rated their EMG‐related pain after each muscle was studied on a 100‐point visual analog scale (VAS). Investigators recorded the order in which the muscles were sampled, the total time spent with the needle in each muscle, and whether electrical endplate noise was noted. Results : A total of 1781 muscles were studied in 304 patients. Eleven muscles were associated with significantly more or less pain than the others. Endplate noise was associated with more pain (5.4 mm, 95% CI 2.8–7.0). There was a small, but significant effect from needling time (0.02 mm, 95% CI 0.00–0.04). Conclusions : Among factors that electromyographers can control, muscle selection has the greatest impact on pain. Our data include an extensive list of muscle‐specific EMG‐related pain scores. Provider and other study characteristics have little or no impact on EMG‐related pain. Muscle Nerve 49:570–574, 2014Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/106736/1/mus23974.pd

On k-Column Sparse Packing Programs

We consider the class of packing integer programs (PIPs) that are column sparse, i.e. there is a specified upper bound k on the number of constraints that each variable appears in. We give an (ek+o(k))-approximation algorithm for k-column sparse PIPs, improving on recent results of $k^2\cdot 2^k$ and $O(k^2)$. We also show that the integrality gap of our linear programming relaxation is at least 2k-1; it is known that k-column sparse PIPs are $\Omega(k/ \log k)$-hard to approximate. We also extend our result (at the loss of a small constant factor) to the more general case of maximizing a submodular objective over k-column sparse packing constraints.Comment: 19 pages, v3: additional detail

Implication of TRIMalpha and TRIMCyp in interferon-induced anti-retroviral restriction activities

<p>Abstract</p> <p>Background</p> <p>TRIM5α is a restriction factor that interferes with retroviral infections in a species-specific manner in primate cells. Although TRIM5α is constitutively expressed, its expression has been shown to be up-regulated by type I interferon (IFN). Among primates, a particular case exists in owl monkey cells, which express a fusion protein between TRIM5 and cyclophilin A, TRIMCyp, specifically interfering with HIV-1 infection. No studies have been conducted so far concerning the possible induction of TRIMCyp by IFN. We investigated the consequences of IFN treatment on retroviral restriction in diverse primate cells and evaluated the implication of TRIM5α or TRIMCyp in IFN-induced anti-retroviral activities.</p> <p>Results</p> <p>First, we show that human type I IFN can enhance TRIM5α expression in human, African green monkey and macaque cells, as well as TRIMCyp expression in owl monkey cells. In TRIM5α-expressing primate cell lines, type I IFN has little or no effect on HIV-1 infection, whereas it potentates restriction activity against N-MLV in human and African green monkey cells. In contrast, type I IFN treatment of owl monkey cells induces a great enhancement of HIV-1 restriction, as well as a strain-tropism independent restriction of MLV. We were able to demonstrate that TRIM5α is the main mediator of the IFN-induced activity against N-MLV in human and African green monkey cells, whereas TRIMCyp mediates the IFN-induced HIV-1 restriction enhancement in owl monkey cells. In contrast, the type I IFN-induced anti-MLV restriction in owl monkey cells is independent of TRIMCyp expression.</p> <p>Conclusion</p> <p>Together, our observations indicate that both TRIM5α and TRIMCyp are implicated in IFN-induced anti-retroviral response in primate cells. Furthermore, we found that type I IFN also induces a TRIMCyp-independent restriction activity specific to MLV in owl monkey cells.</p

Adult attachment styles and the psychological response to infant bereavement

Background: Based on Bowlby's attachment theory, Bartholomew proposed a four-category attachment typology by which individuals judged themselves and adult relationships. This explanatory model has since been used to help explain the risk of psychiatric comorbidity. Objective: The current study aimed to identify attachment typologies based on Bartholomew's attachment styles in a sample of bereaved parents on dimensions of closeness/dependency and anxiety. In addition, it sought to assess the relationship between the resultant attachment typology with a range of psychological trauma variables. Method: The current study was based on a sample of 445 bereaved parents who had experienced either peri- or post-natal death of an infant. Adult attachment was assessed using the Revised Adult Attachment Scale (RAAS) while reaction to trauma was assessed using the Trauma Symptom Checklist (TSC). A latent profile analysis was conducted on scores from the RAAS closeness/dependency and anxiety subscales to ascertain if there were underlying homogeneous attachment classes. Emergent classes were used to determine if these were significantly different in terms of mean scores on TSC scales. Results: A four-class solution was considered the optimal based on fit statistics and interpretability of the results. Classes were labelled “Fearful,” “Preoccupied,” “Dismissing,” and “Secure.” Females were almost eight times more likely than males to be members of the fearful attachment class. This class evidenced the highest scores across all TSC scales while the secure class showed the lowest scores. Conclusions: The results are consistent with Bartholomew's four-category attachment styles with classes representing secure, fearful, preoccupied, and dismissing types. While the loss of an infant is a devastating experience for any parent, securely attached individuals showed the lowest levels of psychopathology compared to fearful, preoccupied, or dismissing attachment styles. This may suggest that a secure attachment style is protective against trauma-related psychological distress

Parallelisation and application of AD3 as a method for solving large scale combinatorial auctions

Auctions, and combinatorial auctions (CAs), have been successfully employed to solve coordination problems in a wide range of application domains. However, the scale of CAs that can be optimally solved is small because of the complexity of the winner determination problem (WDP), namely of finding the bids that maximise the auctioneer’s revenue. A way of approximating the solution of a WDP is to solve its linear programming relaxation. The recently proposed Alternate Direction Dual Decomposition algorithm (AD3) has been shown to ef- ficiently solve large-scale LP relaxations. Hence, in this paper we show how to encode the WDP so that it can be approximated by means of AD3. Moreover, we present PAR-AD3, the first parallel implementation of AD3. PAR-AD3 shows to be up to 12.4 times faster than CPLEX in a single-thread execution, and up to 23 times faster than parallel CPLEX in an 8-core architecture. Therefore PAR- AD3 becomes the algorithm of choice to solve large-scale WDP LP relaxations for hard instances. Furthermore, PAR-AD3 has potential when considering large- scale coordination problems that must be solved as optimisation problems.Research supported by MICINN projects TIN2011-28689-C02-01, TIN2013-45732-C4-4-P and TIN2012-38876-C02-01Peer reviewe